Anonymous monotonic social welfare functions

نویسندگان

  • Jay Sethuraman
  • Chung-Piaw Teo
  • Rakesh V. Vohra
چکیده

This paper presents two results about preference domain conditions that deepen our understanding of anonymous and monotonic Arrovian social welfare functions (ASWFs). We characterize the class of anonymous and monotonic ASWFs on domains without Condorcet triples. This extends and generalizes an earlier characterization (as Generalized Majority Rules) by Moulin (Axioms of Cooperative Decision Making, Cambridge University Press, New York, 1988) for single-peaked domains. We also describe a domain where anonymous and monotonic ASWFs exist only when there are an odd number of agents. This is a counter-example to a claim by Muller (Int. Econ. Rev. 23 (1982) 609), who asserted that the existence of 3-person anonymous and monotonic ASWFs guaranteed the existence of n-person anonymous and monotonic ASWFs for any n> 3. Both results build upon the integer programming approach to the study of ASWFs introduced in Sethuraman et al. (Math. Oper. Res. 28 (2003) 309). © 2005 Elsevier Inc. All rights reserved. JEL classification: D6; D7

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal manipulability: anonymity and unanimity

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We conjecture that these examples are in fact all minimally manipulable social choice functions. Since some of th...

متن کامل

Integer Programming and Social Choice

We characterize the class of Arrovian Social Welfare Functions as integer solutions to a collection of linear inequalities. Many of the known results about impossibility, Arrovian Social Welfare Functions, properties of the majority rule etc., can be derived in a simple and unified way from this integer program. We characterize those preference domains that admit a non-dictatorial, neutral Arro...

متن کامل

Maskin-monotonic scoring rules

We characterize which scoring rules are Maskin-monotonic for each social choice problem as a function of the number of agents and the number of alternatives. We show that a scoring rule is Maskin-monotonic if and only if it satisfies a certain unanimity condition. Since scoring rules are neutral, Maskin-monotonicity turns out to be equivalent to Nash-implementability within the class of scoring...

متن کامل

Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach∗

In the line opened by Kalai and Muller (1977), we explore new conditions on preference domains which make it possible to avoid Arrow’s impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictatorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In...

متن کامل

Anonymous and neutral majority rules

In the standard arrovian framework and under the assumptions that individual preferences and social outcomes are linear orders over the set of alternatives, we provide necessary and sufficient conditions for the existence of anonymous and neutral rules and for the existence of anonymous and neutral majority rules. We determine also general formulas for counting these rules and we explicitly det...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 128  شماره 

صفحات  -

تاریخ انتشار 2006